High-order noise filtering in nontrivial quantum logic gates

Treating the effects of a time-dependent classical dephasing environment during quantum logic operations poses a theoretical challenge, as the application of non-commuting control operations gives rise to both dephasing and depolarization errors that must be accounted for in order to understand total average error rates. We develop a treatment based on effective Hamiltonian theory that allows us to efficiently model the effect of classical noise on nontrivial single-bit quantum logic operations composed of arbitrary control sequences. We present a general method to calculate the ensemble-averaged entanglement fidelity to arbitrary order in terms of noise filter functions, and provide explicit expressions to fourth order in the noise strength. In the weak noise limit we derive explicit filter functions for a broad class of piecewise-constant control sequences, and use them to study the performance of dynamically corrected gates, yielding good agreement with brute-force numerics.Comment: Revised and expanded to include filter function terms beyond first order in the Magnus expansion. Related manuscripts available from http://www.physics.usyd.edu.au/~mbiercu

Robustness of composite pulses to time-dependent control noise

We study the performance of composite pulses in the presence of time-varying control noise on a single qubit. These protocols, originally devised only to correct for static, systematic errors, are shown to be robust to time-dependent non-Markovian noise in the control field up to frequencies as high as ~10% of the Rabi frequency. Our study combines a generalized filter-function approach with asymptotic dc-limit calculations to give a simple analytic framework for error analysis applied to a number of composite-pulse sequences relevant to nuclear magnetic resonance as well as quantum information experiments. Results include examination of recently introduced concatenated composite pulses and dynamically corrected gates, demonstrating equivalent first-order suppression of time-dependent fluctuations in amplitude and/or detuning, as appropriate for the sequence in question. Our analytic results agree well with numerical simulations for realistic $1/f$ noise spectra with a roll-off to $1/f^2$, providing independent validation of our theoretical insights.Comment: 11 pages, 4 figures, text and figures updated to published versio

Provenance Semirings

We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and why provenance are particular cases of the same general algorithms involving semirings. This further suggests a comprehensive provenance representation that uses semirings of polynomials. We extend these considerations to datalog and semirings of formal power series. We give algorithms for datalog provenance calculation as well as datalog evaluation for incomplete and probabilistic databases. Finally, we show that for some semirings containment of conjunctive queries is the same as for standard set semantics

Ronciling Differences

In this paper we study a problem motivated by the management of changes in databases. It turns out that several such change scenarios, e.g., the separately studied problems of view maintenance (propagation of data changes) and view adaptation (propagation of view definition changes) can be unified as instances of query reformulation using views provided that support for the relational difference operator exists in the context of query reformulation. Exact query reformulation using views in positive relational languages is well understood, and has a variety of applications in query optimization and data sharing. Unfortunately, most questions about queries become undecidable in the presence of difference (or negation), whether we use the foundational set semantics or the more practical bag semantics. We present a new way of managing this difficulty by defining a novel semantics, Z- relations, where tuples are annotated with positive or negative integers. Z-relations conveniently represent data, insertions, and deletions in a uniform way, and can apply deletions with the union operator (deletions are tuples with negative counts). We show that under Z-semantics relational algebra (R A) queries have a normal form consisting of a single difference of positive queries, and this leads to the decidability of their equivalence.We provide a sound and complete algorithm for reformulating R A queries, including queries with difference, over Z-relations. Additionally, we show how to support standard view maintenanc

Structural comparisons of the nucleoprotein from three negative strand RNA virus families

Structures of the nucleoprotein of three negative strand RNA virus families, borna disease virus, rhabdovirus and influenza A virus, are now available. Structural comparisons showed that the topology of the RNA binding region from the three proteins is very similar. The RNA was shown to fit into a cavity formed by the two distinct domains of the RNA binding region in the rhabdovirus nucleoprotein. Two helices connecting the two domains characterize the center of the cavity. The nucleoproteins contain at least 5 conserved helices in the N-terminal domain and 3 conserved helices in the C-terminal domain. Since all negative strand RNA viruses are required to have the ribonucleoprotein complex as their active genomic templates, it is perceivable that the (5H+3H) structure is a common motif in the nucleoprotein of negative strand RNA viruses

Designing a Practical High-Fidelity Long-Time Quantum Memory

Quantum memory is a central component for quantum information processing devices, and will be required to provide high-fidelity storage of arbitrary states, long storage times and small access latencies. Despite growing interest in applying physical-layer error-suppression strategies to boost fidelities, it has not previously been possible to meet such competing demands with a single approach. Here we use an experimentally validated theoretical framework to identify periodic repetition of a high-order dynamical decoupling sequence as a systematic strategy to meet these challenges. We provide analytic bounds—validated by numerical calculations—on the characteristics of the relevant control sequences and show that a ‘stroboscopic saturation’ of coherence, or coherence plateau, can be engineered, even in the presence of experimental imperfection. This permits high-fidelity storage for times that can be exceptionally long, meaning that our device-independent results should prove instrumental in producing practically useful quantum technologies

Dynamical Decoupling Sequences for Multi-Qubit Dephasing Suppression and Long-Time Quantum Memory

We consider a class of multi-qubit dephasing models that combine classical noise sources and linear coupling to a bosonic environment, and are controlled by arbitrary sequences of dynamical decoupling pulses. Building on a general transfer filter-function framework for open-loop control, we provide an exact representation of the controlled dynamics for arbitrary stationary non-Gaussian classical and quantum noise statistics, with analytical expressions emerging when all dephasing sources are Gaussian. This exact characterization is used to establish two main results. First, we construct multi-qubit sequences that ensure maximum high-order error suppression in both the time and frequency domain and that can be exponentially more efficient than existing ones in terms of total pulse number. Next, we show how long-time multi-qubit storage may be achieved by meeting appropriate conditions for the emergence of a fidelity plateau under sequence repetition, thereby generalizing recent results for single-qubit memory under Gaussian dephasing. In both scenarios, the key step is to endow multi-qubit sequences with a suitable displacement anti-symmetry property, which is of independent interest for applications ranging from environment-assisted entanglement generation to multi-qubit noise spectroscopy protocols

A survey study of index food‐related allergic reactions and anaphylaxis management

Background:  Initial food‐allergic reactions are often poorly recognized and under‐treated. Methods:  Parents of food‐allergic children were invited to complete an online questionnaire, designed with Kids with Food Allergies Foundation , about their children’s first food‐allergic reactions resulting in urgent medical evaluation. Results:  Among 1361 reactions, 76% (95% CI 74–79%) were highly likely to represent anaphylaxis based on NIAID/FAAN criteria. Only 34% (95% CI 31–37%) of these were administered epinephrine. In 56% of these, epinephrine was administered by emergency departments; 20% by parents; 9% by paramedics; 8% by primary care physicians; and 6% by urgent care centers. In 26% of these, epinephrine was given within 15 min of the onset of symptoms; 54% within 30 min; 82% within 1 h; and 93% within 2 h. Factors associated with a decreased likelihood of receiving epinephrine for anaphylaxis included age <12 months, milk and egg triggers, and symptoms of abdominal pain and/or diarrhea. Epinephrine was more likely to be given to asthmatic children and children with peanut or tree nut ingestion prior to event. Post‐treatment, 42% of reactions likely to represent anaphylaxis were referred to allergists, 34% prescribed and/or given epinephrine auto‐injectors, 17% trained to use epinephrine auto‐injectors, and 19% given emergency action plans. Of patients treated with epinephrine, only half (47%) were prescribed epinephrine auto‐injectors. Conclusions:  Only one‐third of initial food‐allergic reactions with symptoms of anaphylaxis were recognized and treated with epinephrine. Fewer than half of patients were referred to allergists. There is still a need to increase education and awareness about food‐induced anaphylaxis.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/93515/1/pai1315.pd

Cryo-EM model of the bullet-shaped vesicular stomatitis virus.

Vesicular stomatitis virus (VSV) is a bullet-shaped rhabdovirus and a model system of negative-strand RNA viruses. Through direct visualization by means of cryo-electron microscopy, we show that each virion contains two nested, left-handed helices: an outer helix of matrix protein M and an inner helix of nucleoprotein N and RNA. M has a hub domain with four contact sites that link to neighboring M and N subunits, providing rigidity by clamping adjacent turns of the nucleocapsid. Side-by-side interactions between neighboring N subunits are critical for the nucleocapsid to form a bullet shape, and structure-based mutagenesis results support this description. Together, our data suggest a mechanism of VSV assembly in which the nucleocapsid spirals from the tip to become the helical trunk, both subsequently framed and rigidified by the M layer